On the Practicality of Low-Density Parity-Check Codes
نویسنده
چکیده
Recent advances in coding theory have produced two classes of codes, turbo codes and low-density parity-check (LDPC) codes, which approach the Shannon limit of channel capacity while admitting efficient implementations of message encoding and decoding in software. Theoretic results about the latter have been shown to apply to the former, hence we examine the evolution of LDPC codes from their origin in Gallager’s 1963 thesis to their current incarnation as tornado codes developed by Luby, Mitzenmacher, Shokrollahi, and Spielman. After considering several analytic approaches to quantifying their performance, we discuss the practicality of LDPC codes, particularly those designed for the erasure channel, when applied to a number of current problems in networking.
منابع مشابه
Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملA Construction for Low Density Parity Check Convolutional Codes Based on Quasi-Cyclic Block Codes
A set of convolutional codes with low density parity check matrices is derived from a class of quasi-cyclic low density parity check block codes. Their performance when decoded using the belief propagation algorithm is investigated.
متن کاملImproved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propagation
We construct new families of error-correcting codes based on Gallager’s low-density parity-check codes, which we call irregular codes. When decoded using belief propagation, our codes can correct more errors than previously known low-density parity-check codes. For example, for rate 1/4 codes on 16,000 bits over a binary symmetric channel, previous low-density parity-check codes can correct up ...
متن کاملParity-Check Matrix Extension to Lower the Error Floors of Irregular LDPC Codes
Trapping sets have been identified as one of the main factors causing error floors of low-density parity-check (LDPC) codes at high SNR values. By adding several new rows to the original parity-check matrix, a novel method is proposed to eliminate small trapping sets in the LDPC code’s Tanner graph. Based on this parity-check matrix extension, we design new codes with low error floors from the ...
متن کاملOn Low-Density Parity-Check Convolutional Codes
Abstract – In this paper a formal theory, construction methods, and a random ensemble approach for low-density parity-check convolutional codes (including turbo-codes) are presented. The principles of iterative decoding of low-density parity-check (LDPC) convolutional codes are given, and an iterative algorithm for decoding of homogeneous LDPC convolutional codes is described. Some simulation r...
متن کامل